Congruence Formats for Weak Readiness Equivalence and Weak Possible Future Equivalence

Weak equivalences are important behavioral equivalences in the course of specifying and analyzing reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric readiness equivalences, which take two previously-known behavioral equivalences, i.e., the weak readiness equivalence and the weak possible future equivalence, as their special cases. More importantly, based on the idea of Structural Operational Semantics, a series of rule formats are further presented to guarantee congruence for these weak parametric readiness equivalences, i.e., to show that the proposed rule formats can guarantee the congruence of their corresponding weak parametric readiness equivalences. This series of rule formats reflect the differences in the weak parametric readiness equivalences. We conclude that, when the weak parametric readiness equivalences become coarser, their corresponding rule formats